Necessary Conditions For the Non-existence of Odd Perfect Numbers
نویسنده
چکیده
We start with a result showing most odd cubes cannot be perfect numbers (see Theorem 1). Then we give a new proof of a special case of a result of Iannucci (see [IAN]) that shows that none of the even exponents in N ’s prime factorization can be congruent to 4 (mod 5) if 3|N (Theorem 2). We then extend that result by proving that certain sets of small primes, when taken to a large power, cannot divide an odd perfect number. This generates an upper bound on the number of small primes dividing certain odd perfect numbers (see Theorem 3-4 and Proposition 1).
منابع مشابه
A Study on the Necessary Conditions for Odd Perfect Numbers
A collection of all of the known necessary conditions for an odd perfect number to exist, along with brief descriptions as to how these were discovered. This was done in order to facilitate those who would like to further pursue the necessary conditions for odd perfect numbers, or those who are searching for odd perfect numbers themselves. All past research into odd perfect numbers has been col...
متن کامل# A 6 INTEGERS 12 A ( 2012 ) : John Selfridge Memorial Issue ON ODD PERFECT NUMBERS AND EVEN 3 - PERFECT NUMBERS
An idea used in the characterization of even perfect numbers is used, first, to derive new necessary conditions for the existence of an odd perfect number and, second, to show that there are no even 3-perfect numbers of the form 2aM , where M is odd and squarefree and a ≤ 718, besides the six known examples. –In memory of John Selfridge
متن کاملThe third largest prime divisor of an odd perfect number exceeds one hundred
Let σ(n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if σ(n) = 2n. It is well known that a number is even and perfect if and only if it has the form 2p−1(2p − 1) where 2p − 1 is prime. It is unknown whether or not odd perfect numbers exist, although many conditions necessary for their existence have been found. For example, Cohen and Hagis ha...
متن کاملThe second largest prime divisor of an odd perfect number exceeds ten thousand
Let σ(n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if σ(n) = 2n. It is well known that a number is even and perfect if and only if it has the form 2p−1(2p − 1) where 2p − 1 is prime. No odd perfect numbers are known, nor has any proof of their nonexistence ever been given. In the meantime, much work has been done in establishing conditions ...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005